Computable eigenvalue bounds for rank-k perturbations

A geometric method for eigenvalue problems with low-rank perturbations

We consider the problem of finding the spectrum of an operator taking the form of a low-rank (rank one or two) non-normal perturbation of a well-understood operator, motivated by a number of problems of applied interest which take this form. We use the fact that the system is a low-rank perturbation of a solved problem, together with a simple idea of classical differential geometry (the envelop...

Eigenvalue Placement for Regular Matrix Pencils with Rank One Perturbations

A regular matrix pencil sE − A and its rank one perturbations are considered. We determine the sets in C ∪ {∞} which are the eigenvalues of the perturbed pencil. We show that the largest Jordan chains at each eigenvalue of sE − A may disappear and the sum of the length of all destroyed Jordan chains is the number of eigenvalues (counted with multiplicities) which can be placed arbitrarily in C∪...

Computable Bounds for Polynomial Ergodicity

Computable Convergence Bounds for GMRES

The purpose of this paper is to derive new computable convergence bounds for GMRES. The new bounds depend on the initial guess and are thus conceptually different from standard “worst-case” bounds. Most importantly, approximations to the new bounds can be computed from information generated during the run of a certain GMRES implementation. The approximations allow predictions of how the algorit...

k-HYPONORMALITY OF FINITE RANK PERTURBATIONS OF UNILATERAL WEIGHTED SHIFTS

Abstract. In this paper we explore finite rank perturbations of unilateral weighted shifts Wα. First, we prove that the subnormality of Wα is never stable under nonzero finite rank pertrubations unless the perturbation occurs at the zeroth weight. Second, we establish that 2-hyponormality implies positive quadratic hyponormality, in the sense that the Maclaurin coefficients ofDn(s) := detPn [(W...